Computing local invariants of quantum-bit systems
نویسندگان
چکیده
منابع مشابه
Computing local invariants of quantum-bit systems
We investigate means to describe the nonlocal properties of quantum systems and to test if two quantum systems are locally equivalent. For this we consider quantum systems that consist of several subsystems, especially multiple quantum bits, i.e., systems consisting of subsystems of dimension 2. We compute invariant polynomials, i.e., polynomial functions of the entries of the density operator ...
متن کاملComputing Local Invariants of Qubit Systems
We investigate means to describe the non-local properties of quantum systems and to test if two quantum systems are locally equivalent. For this we consider quantum systems that consist of several subsystems, especially multiple qubits, i. e., systems consisting of subsystems of dimension two. We compute invariant polynomials, i. e., polynomial functions of the entries of the density operator w...
متن کاملLocal Invariants of Smooth Control Systems
Methods are presented for locally studying smooth nonlinear control systems on the manifold M. The technique of chronological calculus is intensively exploited. The concept of chronological connection is introduced and is used when obtaining the invariant expressions in the form of Lie bracket polynomials for high-order variations of a nonlinear control system. The theorem on adduction of a fam...
متن کاملComputing Cohomology of Local Systems
Let V be a holomorphic vector bundle on a complex manifold M , with a flat connection ∇. We shall make the following three assumptions: (1) M is an open subset of a bigger complex manifold M . (2) The boundary D = M \M is a divisor with normal crossing singularities. (3) The connection ∇ is unipotent along D. Under these assumptions, V has a canonical extension to a vector bundle V on M . Since...
متن کاملSynthesizing Safe Bit-Precise Invariants
Bit-precise software verification is an important and difficult problem. While there has been an amazing progress in SAT solving, Satisfiability Modulo Theory of Bit Vectors, and bit-precise Bounded Model Checking, proving bit-precise safety, i.e. synthesizing a safe inductive invariant, remains a challenge. Although the problem is decidable and is reducible to propositional safety by bit-blast...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 1998
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.58.1833